<i>N</i>-colored generalized Frobenius partitions: generalized Kolitsch identities

نویسندگان

چکیده

Abstract Let $N\geq 1$ be squarefree with $(N,6)=1$ . $c\phi _N(n)$ denote the number of N -colored generalized Frobenius partitions n introduced by Andrews in 1984, and $P(n)$ We prove $$ \begin{align*}c\phi_N(n)= \sum_{d \mid N} N/d \cdot P\left( \frac{ N}{d^2}n - \frac{N^2-d^2}{24d^2} \right) + b(n),\end{align*} where $C(z) := (q;q)^N_\infty \sum _{n=1}^{\infty } b(n) q^n$ is a cusp form $S_{(N-1)/2} (\Gamma _0(N),\chi _N)$ This extends strengthens earlier results Kolitsch Chan–Wang–Yan treating case when prime. As an immediate application, we obtain asymptotic formula for terms classical partition function

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A simple proof of some congruences for colored generalized frobenius partitions

where c#,Jr) is the number of F-partitions of r using h colors with (at most) s repetitions where s can be any positive integer or 00 (to represent no restriction on repetitions). The proofs of these congruences were based on some interesting congruence properties of compositions and were combinatorial in nature. Though the proofs were straightforward, they were somewhat lengthy and tedious. Du...

متن کامل

Overpartitions and Generating Functions for Generalized Frobenius Partitions

Generalized Frobenius partitions, or F -partitions, have recently played an important role in several combinatorial investigations of basic hypergeometric series identities. The goal of this paper is to use the framework of these investigations to interpret families of infinite products as generating functions for F -partitions. We employ q-series identities and bijective combinatorics.

متن کامل

On multi-color partitions and the generalized Rogers-Ramanujan identities

Basil Gordon, in the sixties, and George Andrews, in the seventies, generalized the Rogers-Ramanujan identities to higher moduli. These identities arise in many areas of mathematics and mathematical physics. One of these areas is representation theory of infinite dimensional Lie algebras, where various known interpretations of these identities have led to interesting applications. Motivated by ...

متن کامل

Computational Proofs of Congruences for 2-colored Frobenius Partitions

1. Background and introduction. In his 1984 Memoir of the American Mathematical Society, Andrews [2] introduced two families of partition functions, φk(m) and cφk(m), which he called generalized Frobenius partition functions. In this paper, we will focus our attention on one of these functions, namely cφ2(m), which denotes the number of generalized Frobenius partitions of m with 2 colors. In [2...

متن کامل

Generalized Foster’s Identities

Foster’s first identity, which is also known as Foster’s network theorem, was initially proved by R. M. Foster [Fo1] in 1949 by using Kirchhoff’s rule. In 1990, D. Copersmith, P. Doyle, P. Raghavan, and M. Snir [CDRS] gave another proof of this theorem by using random walks on graphs. Independently, in 1991, P. Tetali [TP1] gave a third proof of this theorem again by using random walks on graph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Canadian Journal of Mathematics

سال: 2022

ISSN: ['1496-4279', '0008-414X']

DOI: https://doi.org/10.4153/s0008414x22000025